An Improved RSA Algorithm for Enhanced Security

The security of the Rivest-Shamir-Adelman (RSA) public key algorithm depends on difficulty factoring modulus calculated by multiplying two large prime numbers. usefulness RSA lies in using one for encryption and another decryption. However, a poor choice keys used decryption can affect cryptosystem. Many proposals have been made to modify cryptosystem such way that attacks be overcome. In this article, we propose concealing publicly disclosed parameters, common altering values sent publicly. are different from which conceals actual parameters others. implementation idea uses algorithms randomly choosing between algorithms. is done random number generator has communicated so decryptor correct decrypt encrypted data. Finally explore faster implement modular exponentiation